A restarted Induced Dimension Reduction method to approximate eigenpairs of large unsymmetric matrices
نویسندگان
چکیده
Background • The IDR(s) was introduced for solving linear systems in [3]. • IDR(s) creates residual vectors in the nested and shrinking subspaces Gj defined as Gj ≡ (A− μjI)(Gj−1 ∩ P⊥) j = 1, 2, . . . where P ∈ Cn×s and G0 ≡ C; in order to extract the approximated solution. • First IDR(s) method to solve Eq. (1) was proposed by M. H. Gutknecht and J.-P. M. Zemke [2]. The work we present here is an extension of [1].
منابع مشابه
On the squared unsymmetric Lanczos method
The biorthogonal Lanczos and the biconjugate gradient methods have been proposed as iterative methods to approximate the solution of nonsymmetric and indefinite linear systems. Sonneveld (1989) obtained the conjugate gradient squared by squaring the matrix polynomials of the biconjugate gradient method. Here we square the unsymmetric (or biorthogonal) Lanczos method for computing the eigenvalue...
متن کاملSome new restart vectors for explicitly restarted Arnoldi method
The explicitly restarted Arnoldi method (ERAM) can be used to find some eigenvalues of large and sparse matrices. However, it has been shown that even this method may fail to converge. In this paper, we present two new methods to accelerate the convergence of ERAM algorithm. In these methods, we apply two strategies for the updated initial vector in each restart cycles. The implementation of th...
متن کاملAn effective method for eigen-problem solution of fluid-structure systems
Efficient mode shape extraction of fluid-structure systems is of particular interest in engineering. An efficient modified version of unsymmetric Lanczos method is proposed in this paper. The original unsymmetric Lanczos method was applied to general form of unsymmetric matrices, while the proposed method is developed particularly for the fluid-structure matrices. The method provides us with si...
متن کاملAN ALGORITHM FOR FINDING THE EIGENPAIRS OF A SYMMETRIC MATRIX
The purpose of this paper is to show that ideas and techniques of the homotopy continuation method can be used to find the complete set of eigenpairs of a symmetric matrix. The homotopy defined by Chow, Mallet- Paret and York [I] may be used to solve this problem with 2""-n curves diverging to infinity which for large n causes a great inefficiency. M. Chu 121 introduced a homotopy equation...
متن کاملMultiple Explicitly Restarted Arnoldi Method for Solving Large Eigenproblems
In this paper we propose a new approach for calculating some eigenpairs of large sparse nonHermitian matrices. This method, called Multiple Explicitly Restarted Arnoldi (MERAM), is particularly well suited for environments that combine different parallel programming paradigms. This technique is based on a multiple use of Explicitly Restarted Arnoldi method and improves its convergence. This tec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Computational Applied Mathematics
دوره 296 شماره
صفحات -
تاریخ انتشار 2016